On Queues with Inter-Arrival Times Proportional to Service Times

We analyze a family of queueing systems where the interarrival time I n+1 between customers n and n + 1 depends on the service time B n of customer n. Speciically, we consider cases where the dependency between I n+1 and B n is a proportionality relation, and B n is an exponentially distributed random variable. Such dependencies arise in the context of packet-switched networks which use rate policing functions to regulate the amount of data that can arrive to a link within any given time interval. These controls result in signiicant dependencies between the amount of work brought in by customers/packets and the time between successive customers. The models developed in the paper and the associated solutions are, however, of independent interest and are potentially applicable to other environments. Several scenarios which consist of adding an independent random variable to the inter-arrival time, allowing the proportionality to be random and the combination of the two are considered. In all cases we provide expressions for the Laplace-Stieltjes Transform(LST) of the waiting time of a customer in the system. Numerical results are provided and compared to those of an equivalent system without dependencies.